Recurrent substrings and data fusion for language recognition
نویسندگان
چکیده
Recurrent phone substrings that are characteristic of a language are a promising technique for language recognition. In previous work on language recognition, building anti-models to normalise the scores from acoustic phone models for target languages, has been shown to reduce the Equal Error Rate (ERR) by a third. Recurrent substrings and anti-models have now been applied alongside three other techniques (bigrams, usefulness and frequency histograms) to the NIST 1996 Language Recognition Evaluation, using data from the CALLFRIEND and OGI databases for training. By fusing scores from the different techniques using a multi-layer perceptron the ERR on the NIST data can be reduced further.
منابع مشابه
Urban Vegetation Recognition Based on the Decision Level Fusion of Hyperspectral and Lidar Data
Introduction: Information about vegetation cover and their health has always been interesting to ecologists due to its importance in terms of habitat, energy production and other important characteristics of plants on the earth planet. Nowadays, developments in remote sensing technologies caused more remotely sensed data accessible to researchers. The combination of these data improves the obje...
متن کاملFuzzy Clustering Approach Using Data Fusion Theory and its Application To Automatic Isolated Word Recognition
In this paper, utilization of clustering algorithms for data fusion in decision level is proposed. The results of automatic isolated word recognition, which are derived from speech spectrograph and Linear Predictive Coding (LPC) analysis, are combined with each other by using fuzzy clustering algorithms, especially fuzzy k-means and fuzzy vector quantization. Experimental results show that the...
متن کاملBayesian Data Fusion: a Reliable Approach for Descriptive Modeling of Ore Deposits
Recognition of ore deposit genesis is still a controversial challenge for economic geologists. Here, this task was addressed by the virtue of Bayesian data fusion (BDF) implementing available proofs: semi-schematic examples with two (Cu and Pb + Zn) and three (Cu, Pb + Zn and Ag) evidences. The data, in current paper are just concentrations of indicated elements, were collected from Angouran’s ...
متن کاملRecognizing Substrings of LR ( k ) Languagesin
LR parsing techniques have long been studied as eecient and powerful methods for processing context free languages. A linear time algorithm for recognizing languages representable by LR(k) grammars has long been known. Recognizing substrings of a context-free language is at least as hard as recognizing full strings of the language, as the latter problem easily reduces to the former. In this pap...
متن کاملIn Proceedings of POPL - 92 Recognizing Substrings of LR ( k ) Languages in Linear
LR parsing techniques have long been studied as eecient and powerful methods for processing context free languages. A linear time algorithm for recognizing languages representable by LR(k) grammars has long been known. Recognizing substrings of a context-free language is at least as hard as recognizing full strings of the language , as the latter problem easily reduces to the former. In this pa...
متن کامل